Ranking procedures by pairwise comparison using random sets and the imprecise Dirichlet model
نویسنده
چکیده
Methods for ranking of alternatives or objects by pairwise comparisons using random set theory are proposed in the paper. Efficient algorithms weekly depending on the number of independent sources of data are considered. Methods using the imprecise Dirichlet model are used for obtaining cautious comparison measures when the number of expert judgments is rather small and standard methods of random set theory may give risky results. The methods allow us to overcome some difficulties concerning the conflicting or contradictory sources of data. Various numerical examples illustrate the proposed algorithms and methods.
منابع مشابه
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
0888-613X/$ see front matter 2010 Elsevier Inc doi:10.1016/j.ijar.2010.08.007 ⇑ Corresponding author. E-mail addresses: [email protected] (G. Corani), ca We present TANC, a TAN classifier (tree-augmented naive) based on imprecise probabilities. TANC models prior near-ignorance via the Extreme Imprecise Dirichlet Model (EDM). A first contribution of this paper is the experimental comparison betwe...
متن کاملA new ranking procedure by incomplete pairwise comparisons using preference subsets
A method for ranking of alternatives or objects and its extensions by incomplete pairwise comparisons using Dempster-Shafer theory are proposed in the paper. The main feature of the method is that it allows us to deal with comparisons of arbitrary subsets of alternatives. The method is extended on the case of independent groups of experts. The imprecise Dirichlet model is also used to make caut...
متن کاملSelection of Favorite Reusable Launch Vehicle Concepts by using the Method of Pairwise Comparison
The contribution of this paper to the space transportation system field is to select promising Reusable Launch Vehicle (RLV) concepts by using a formal evaluation procedure. The vehicle system is divided into design features. Every design feature can have alternative characteristics. All combinations of design features and characteristics are compared pairwise with each other. The innovation an...
متن کاملLabelwise versus Pairwise Decomposition in Label Ranking
Label ranking is a specific type of preference learning problem, namely the problem of learning a model that maps instances to rankings over a finite set of predefined alternatives (labels). State-of-the-art approaches to label ranking include decomposition techniques that reduce the original problem to binary classification; ranking by pairwise comparison (RPC), for example, constructs one bin...
متن کاملDetermination of weight vector by using a pairwise comparison matrix based on DEA and Shannon entropy
The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 183 شماره
صفحات -
تاریخ انتشار 2006